Quantum Metropolis Solver: a quantum walks approach to optimization problems

Abstract The efficient resolution of optimization problems is one the key issues in today’s industry. This task relies mainly on classical algorithms that present scalability and processing limitations. Quantum computing has emerged to challenge these types problems. In this paper, we focus Metropolis-Hastings quantum algorithm, which based walks. We use algorithm build a software tool called Metropolis Solver (QMS). validate QMS with N-Queen problem show potential advantage an example can be easily extrapolated Artificial Intelligence domain. carry out different simulations performance its configuration.